北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2008, Vol. 31 ›› Issue (4): 29-32.doi: 10.13190/jbupt.200804.29.015

• 论文 • 上一篇    下一篇

虫孔路由NOC的缓冲分配算法

王力纬1, 曹 阳1,2, 李晓辉1, 朱小虎1   

  1. 1. 武汉大学 电子信息学院, 武汉 430079; 2. 武汉大学 软件工程国家重点实验室, 武汉 430072
  • 收稿日期:2008-01-23 修回日期:1900-01-01 出版日期:2008-08-30 发布日期:2008-08-30
  • 通讯作者: 王力纬

A Buffer Allocation Algorithm for Wormhole Routing Networks-on-Chip

WANG Li-wei1, CAO Yang1,2, LI Xiao-hui, ZHU Xiao-hu1   

  1. 1. School of Electronic Information, Wuhan University, Wuhan 430079, China;
    2. State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, China
  • Received:2008-01-23 Revised:1900-01-01 Online:2008-08-30 Published:2008-08-30
  • Contact: WANG Li-wei

摘要:

提出了一种可应用于虫孔路由片上网络(NOC)的缓冲分配算法。在满足系统总缓冲资源大小不变的情况下,该算法可以依据业务流量的特征在各个路由器的输入通道间分配缓冲资源。仿真结果表明,使用该算法后,系统缓冲资源得到了更有效的利用,数据包平均传输延迟小于均匀分配缓冲的NOC;在热点流量中,该算法可节省约17%的缓冲资源。

关键词: 虫孔路由, 片上网络, 缓冲分配算法

Abstract:

A buffer allocation algorithm for wormhole routing networks-on-chip was proposed. When the total budget of the available buffering space is fixed, the proposed algorithm automatically will, according to the traffic characteristics of the target application, assign the buffer depth for each input channel in different routers across the chip. The simulation results show that the buffer allocation result is more reasonable and smaller average packet latency can be achieved compared to the uniform buffer allocation. For hotspot traffic, about 17% savings in buffering resources can be achieved using our algorithm.

Key words: wormhole routing, networks-on-chip, buffer allocation algorithm

中图分类号: